class Solution { // review 1004 O(N) O(1)
public:
int longestOnes(vector<int>& a, int k) {
int l = 0, r = 0, n = (int)a.size();
for (; r < n; ++r) {
if (a[r] == 0) --k;
if (k < 0 && a[l++] == 0) ++k;
}
return r - l;
}
};
iThome鐵人賽
看影片追技術